ACTÁ ARITHMETICA XLIX (1988) Prime factors of binomial coefficients and related problems

نویسنده

  • L. Selfridge
چکیده

1 . Sequences of positive integers with the consecutive integer property. Consider a sequence of k positive integers {ai} = a,, . . ., a k with the following properties : (i) ai < k for all i, (ü) (the consecutive integer property) There is an n such that ai is the quotient when n + i is cleared of all its prime factors greater than k . Or, for each prime p k, the pattern of that prime and its powers in the a's is the same as the pattern of that prime and its powers in some sequence of k consecutive integers . Notice that the sequence l, 4, 3, 2 satisfies the above properties since the consecutive integers 19, 20, 21, 22 factor into 1 • 19, 4 . 5, 3 . 7 2 . 11 . The sequences 2, 3, 1 and 2, 3, 2 satisfy (i) but not (ü) since if n + 1 is twice an odd number, then 4 divides n + 3 . The sequence l, 6, 1 satisfies (ü) (with n + 1 = 5) but not (i) .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Prime Divisors of Binomial Coefficients

This paper, using computational and theoretical methods, deals with prime divisors of binomial coefficients: Geometric distribution and number of distinct prime divisors are studied. We give a numerical result on a conjecture by Erdôs on square divisors of binomial coefficients.

متن کامل

The Power of a Prime That Divides a Generalized Binomial Coefficient

The main idea is to consider generalized binomial coefficients that are formed from an arbitrary sequence C, as shown in (3) below. We will isolate a property of the sequence C that guarantees the existence of a theorem like Kummer’s, relating divisibility by prime powers to carries in addition. A special case of the theorem we shall prove describes the prime power divisibility of Gauss’s gener...

متن کامل

On Strings of Consecutive Integers with No Large Prime Factors

We investigate conditions which ensure that systems of binomial polynomials with integer coefficients are simultaneously free of large prime factors. In particular, for each positive number ", we show that there are infinitely many strings of consecutive integers of size about n, free of prime factors exceeding n, with the length of the strings tending to infinity with speed log log log log n. ...

متن کامل

On Divisibility Properties of Some Differences of the Central Binomial Coefficients and Catalan Numbers

We discuss divisibility properties of some differences of the central binomial coefficients and Catalan numbers. The main tool is the application of various congruences modulo high prime powers for binomial coefficients combined with some recurrence relevant to these combinatorial quantities.

متن کامل

Partial Semigroups and Primality Indicators in the Fractal Generation of Binomial Coefficients to a Prime Square Modulus

This paper, resulting from two summer programs of Research Experience for Undergraduates, examines the congruence classes of binomial coefficients to a prime square modulus as given by a fractal generation process for lattice path counts. The process depends on the isomorphism of partial semigroup structures associated with each iteration. We also consider integrality properties of certain crit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1988